More about threshold logic

We pursue in this paper some of the ideas discussed a year ago at the First Annual Symposium on Switching Theory and Logical Design. For a general discussion of threshold logic, and for definitions and motivations of the terms used below, the reader is re­ ferred to "Single Stage Threshold Logic'! also published in this volume1l', 131. Also, a general survey of recent papers in the subject has been published elsewhere t14l • The main subject treated below is compound synthesis. The importance of such a study was shown last year: The family of functions of n arguments realizable in a single stage becomes a vanishing fracti�n o� all switching functions of n arguments as n �ows (for n = 7 the ratio is about 102 1/2). We p�ovide an algorithm for determining 2-realizability" -realizability with two threshold elements. The general approach produces a good solution in any case, but one guaranteed optimal only for 2-realizable functions. We use here a geometric terminology; this new language is also used in the second section, where "higher" necessary conditions for realizability are discussed. A conjecture that certain of these conditions might be sufficient is disproved; three re­ lated conditions are treated in a common language. The final section considers optimal integral single-stage realizations, and disproves a conjecture made last year: That such a realization gives equal arguments equal weights. I. COMPOUND SYNTHESIS